github.com/andybalholm/brotli.hashLongestMatchQuickly.buckets (field)

11 uses

	github.com/andybalholm/brotli (current package)
		hash_longest_match_quickly.go#L47: 	buckets []uint32
		hash_longest_match_quickly.go#L51: 	h.buckets = make([]uint32, 1<<h.bucketBits+h.bucketSweep)
		hash_longest_match_quickly.go#L62: 				h.buckets[key+uint32(j)] = 0
		hash_longest_match_quickly.go#L70: 		for i := range h.buckets {
		hash_longest_match_quickly.go#L71: 			h.buckets[i] = 0
		hash_longest_match_quickly.go#L83: 	h.buckets[key+off] = uint32(ix)
		hash_longest_match_quickly.go#L141: 						h.buckets[key] = uint32(cur_ix)
		hash_longest_match_quickly.go#L154: 		prev_ix = uint(h.buckets[key])
		hash_longest_match_quickly.go#L156: 		h.buckets[key] = uint32(cur_ix)
		hash_longest_match_quickly.go#L178: 		bucket = h.buckets[key:]
		hash_longest_match_quickly.go#L213: 	h.buckets[key+uint32((cur_ix>>3)%uint(h.bucketSweep))] = uint32(cur_ix)